Mixing Markov shifts of kernel type are Bernoulli

Institute for Mathematical Physics Resolving Markov Chains onto Bernoulli Shifts Resolving Markov Chains onto Bernoulli Shifts

Weak isomorphisms between Bernoulli shifts

In this note, we prove that if G is a countable group that contains a nonabelian free subgroup then every pair of nontrivial Bernoulli shifts over G are weakly isomorphic.

Brooks’ theorem for Bernoulli shifts

If Γ is an infinite group with finite symmetric generating set S, we consider the graph G(Γ, S) on [0, 1]Γ by relating two distinct points if an element of s sends one to the other via the shift action. We show that, aside from the cases Γ = Z and Γ = (Z/2Z) ∗ (Z/2Z), G(Γ, S) satisfies a measure-theoretic version of Brooks’ theorem: there is a G(Γ, S)-invariant conull Borel set B ⊆ [0, 1]Γ and ...

Powers of Positive Polynomials and Codings of Markov Chains onto Bernoulli Shifts

We give necessary and sufficient conditions for a Markov chain to factor onto a Bernoulli shift (i) as an eventual right-closing factor, (ii) by a right-closing factor map, (iii) by a one-to-one a.e. right-closing factor map, and (iv) by a regular isomorphism. We pass to the setting of polynomials in several variables to represent the Bernoulli shift by a nonnegative polynomial p in several var...

Resolving Markov chains onto Bernoulli